منابع مشابه
Deterministic Percolation
This paper examines percolation questions in a deterministic setting. In particular, I consider R, the set of elements of Z2 with greatest common divisor equal to 1, where two sites are connected if they are at distance 1. The main result of the paper proves that the infinite component has an asymptotic density. An “almost everywhere” sieve of J. Friedlander is used to obtain the result.
متن کاملInvasion Percolation in Presence of Gravity
Simultaneous capillary dominated displacement of the wetting and non-wetting phases are processes of interest in many disciplines including modeling of the penetration of polluting liquids in hydrology or the secondary migration in petroleum reservoir engineering. Percolation models and in particular invasion percolation is well suited to characterize the slow immiscible displaceme...
متن کاملWater Flooding Performance Evaluation Using Percolation Theory
Water flooding is a well-known secondary mechanism for improving oil recovery. Conventional approach to evaluate the performance of a water flooding process (e.g. breakthrough and post breakthrough behavior) is to establish a reliable geological reservoir model, upscale it, and then perform flow simulations. To evaluate the uncertainty in the breakthrough time or post breakthrough behavior, thi...
متن کاملVarinace-Based Sensitivity Analysis of Deterministic Model
The study of many scientific and natural phenomena in laboratory condition is sometimes impossible, therefore theire expresed by mathemathical models and simulated by complex computer models (codes). Running a computer model with different inputs is called a computer expriment. Statistical issues allocated a wide range of applications for computer expriment to itself. In this paper, ...
متن کاملInterference percolation
Let G be an infinite connected graph with minimum degree δ and maximum degree ∆. Let Gp be a random induced subgraph of G obtained by selecting each vertex of G independently with probability p, 0 < p < 1, and let G≤k p be the induced subgraph of Gp obtained by deleting all vertices of Gp with degree greater than k in Gp. We show that if δ ≥ 6 and ∆/δ is not too large then G≤3 p almost surely h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 1999
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s002200050717